A Cartesian Parallel Nested Dissection Algorithm

نویسندگان

  • Michael T. Heath
  • Padma Raghavan
چکیده

shop on Sparse Matrix Computations: Graph Theory Issues and Algorithms, Institute for Mathematics and Its Applications, Springer-Verlag, 1992. [13] G. L. Miller, S. Teng, and S. A. Vavasis, A uni ed geometric approach to graph separators, in Proceedings of the 32nd Annual Symposiumon Foundations of Computer Science, IEEE, 1991, pp. 538{547. [14] G. L. Miller and W. Thurston, Separators in two and three dimensions, in Proc. 22nd Ann. ACM Symp. Theory of Comput., New York, 1990, ACM, pp. 300{309. [15] A. Pothen, H. D. Simon, and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430{452. [16] J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, Maryland, 1984. [17] S. A. Vavasis, Automatic domain partitioning in three dimensions, SIAM J. Sci. Stat. Comput., 12 (1991), pp. 950{970.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Line and Plane Separators

We consider sparse matrices arising from nite-element or nite-diierence methods. The graphs of such matrices are embedded in two or three dimensional Euclidean space, and the coordinates of their vertices are readily available. Such coordinate information was used earlier to develop a parallel Cartesian nested dissection heuristic that computes a ll reducing ordering for a matrix with an embedd...

متن کامل

Performance of a Fully Parallel Sparse Solver

The performance of a fully parallel direct solver for large sparse symmetric positive deenite systems of linear equations is demonstrated. The solver is designed for distributed-memory, message-passing parallel computer systems. All phases of the computation, including symbolic processing as well as numeric factorization and triangular solution, are performed in parallel. A parallel Cartesian n...

متن کامل

Tradeoos between Parallelism and Fill in Nested Dissection

In this paper we demonstrate that tradeoos can be made between parallelism and ll in nested dissection algorithms for Gaussian elimination, both in theory and in practice. We present a new \less parallel nested dissection" algorithm (LPND), and prove that, unlike the standard nested dissection algorithm, when applied to a chordal graph LPND nds a zero-ll elimination order. We have also implemen...

متن کامل

A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices

Article history: Received 18 July 2012 Received in revised form 21 September 2013 Accepted 17 October 2013 Available online 24 October 2013

متن کامل

Parallelizing and De-parallelizing Elimination Orders

The order in which the variables of a linear system are processed determines the total amounts of fill and work to perform LU decomposition on the system. We identify a trade-off between the amounts of fill and work for a given order and the parallelism inherent in that order. We present two algorithms: one that tries to parallelize sequential orders, and another that tries to produce low-fill ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1995